Algorithms for treating equilibrium and fixed point problems

Equilibrium problems and fixed point problems for nonspreading-type mappings in hilbert space

In this paper by using the idea of mean convergence, weintroduce an iterative scheme for finding a common element of theset of solutions of an equilibrium problem and the fixed points setof a nonspreading-type mappings in Hilbert space. A strongconvergence theorem of the proposed iterative scheme is establishedunder some control conditions. The main result of this paper extendthe results obtain...

Iterative algorithms for families of variational inequalities fixed points and equilibrium problems

Iterative Algorithms for the Generalized System of Nonlinear Quasi-Mixed Equilibrium Problems and Fixed Point Problems

The purpose of this paper is to introduce a new generalized system of nonlinear quasi-mixed equilibrium problems and find the common solutions of this problem and a fixed point problem. The results obtained in this paper may be viewed as an extension, refinement and improvement of the previously known results in [2-4] and others. Mathematics Subject Classification: 47H09, 47J25

A General Composite Algorithms for Solving General Equilibrium Problems and Fixed Point Problems in Hilbert Spaces

and Applied Analysis 3 literature. For some works related to the equilibrium problem, fixed point problems, and the variational inequality problem, please see 1–57 and the references therein. However, we note that all constructed algorithms in 7, 9–13, 16, 57 do not work to find the minimum-norm solution of the corresponding fixed point problems and the equilibrium problems. Very recently, Yao ...

Strong Convergence Iterative Algorithms for Equilibrium Problems and Fixed Point Problems in Banach Spaces

and Applied Analysis 3 Recall that the Bregman projection [13] of x ∈ int domf onto the nonempty, closed, and convex subset C of domf is the necessarily unique vector projf C (x) ∈ C satisfying D f (projf C (x) , x) = inf{D f (y, x) : y ∈ C} . (12) Let f : E → (−∞, +∞] be a convex and Gâteaux differentiable function. The function f is said to be totally convex at x ∈ int domf if its modulus of ...